The Non-uniform Fast Fourier Transform in Computed Tomography
نویسنده
چکیده
................................................................................................................................................. I
منابع مشابه
Graphics processing unit accelerated non-uniform fast Fourier transform for ultrahigh-speed, real-time Fourier-domain OCT
We implemented fast Gaussian gridding (FGG)-based non-uniform fast Fourier transform (NUFFT) on the graphics processing unit (GPU) architecture for ultrahigh-speed, real-time Fourier-domain optical coherence tomography (FD-OCT). The Vandermonde matrix-based non-uniform discrete Fourier transform (NUDFT) as well as the linear/cubic interpolation with fast Fourier transform (InFFT) methods are al...
متن کاملFourier-Based Forward and Back-Projectors for Iterative Image Reconstruction
Iterative image reconstruction algorithms play an increasingly important role in modern tomographic systems, especially in emission tomography. With the fast increase of the sizes of the tomographic data, reduction of the computation demands of the reconstruction algorithms is of great importance. Fourier-based forward and back-projection methods have the potential to considerably reduce the co...
متن کاملHigh-speed spectral domain optical coherence tomography using non-uniform fast Fourier transform
The useful imaging range in spectral domain optical coherence tomography (SD-OCT) is often limited by the depth dependent sensitivity fall-off. Processing SD-OCT data with the non-uniform fast Fourier transform (NFFT) can improve the sensitivity fall-off at maximum depth by greater than 5dB concurrently with a 30 fold decrease in processing time compared to the fast Fourier transform with cubic...
متن کاملNFFT: Algorithm for irregular sampling
The nonuniform discrete Fourier transform (NDFT), used in many processing schemes, can be computed using a fast algorithm known as the non uniform fast Fourier transform (NFFT). The NFFT is not a new algorithm, but it is an approximation scheme that can be use to calculate an approximate spectrum. In one dimension, computational complexity of the NFFT is O(NlogN) which is a dramatic improvement...
متن کاملPathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1605.05231 شماره
صفحات -
تاریخ انتشار 2016